On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs
نویسندگان
چکیده
منابع مشابه
On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs
We consider the single-item discrete lot-sizing and scheduling problem. We present a partial linear description of the convex hull of feasible solutions that solves this problem in the presence of Wagner-Whitin costs.
متن کاملOn the Wagner-Whitin Lot-Sizing Polyhedron
We study a family of unbounded polyhedra arising in the study of uncapacitated lot-sizing problems with Wagner-Whitin costs. With n the number of periods, we completely characterize the bounded faces of maximal dimension, and derive an O(n) algorithm to express any point within the polyhedron as a convex combination of extreme points and extreme rays. We also study adjacency on the polyhedra, a...
متن کاملRobust Wagner–Whitin algorithm with uncertain costs
In real-world applications, costs for products are not deterministic: neither static nor dynamic. They actually tend to be non-stationary and cross-correlated. To overcome this drawback, there have been some efforts by researchers to extend the Wagner–Whitin algorithm to consider stochastic costs. However, they assume that the information of probability density function of random costs exists. ...
متن کاملTabu Search for a Discrete Lot Sizing and Scheduling Problem
In this paper we consider a multi-item, multi-machine discrete lot sizing and scheduling problems (DLSP) which consists of finding a minimal cost production schedule over a finite discrete horizon, where in each period a machine may be either producing one item at full capacity or is idle. The demand for each item in each period is known, and can be satisfied either by production in the period,...
متن کاملOn the discrete lot-sizing and scheduling problem with sequence-dependent changeover times
We consider the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs and times and propose to solve it as a mixed-integer program using a commercial solver. Our approach is based on the extension of an existing tight formulation for the case without changeover times. Computational results con rm the bene ts of the proposed solution procedure.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 1997
ISSN: 0167-6377
DOI: 10.1016/s0167-6377(96)00043-0